Reliability Evaluation and Routing Integration in Shuffle Exchange Omega Network
نویسندگان
چکیده
Multistage Interconnection Networks (MINs) are design to provide an effective communication in switching. Shuffle-exchange networks (SENs) have been widely considered as practical interconnection systems due to their size of it switching elements (SEs) and uncomplicated configuration. In this paper, the relationship between reliability performance and number of network size are compared in shuffle exchange network (SEN) and SEN with minus one stages (SEN-). There are three parameters used to measure the reliability performance on these networks which is terminal reliability, broadcast reliability and network reliability. An addition this paper also focused on comparing the algorithm based on SENto achieve the optimal routing time and the number of passes. The algorithms consist of six algorithms namely ZeroX, ZeroY, ZeroXbit, ZeroYbit, Sequential Increasing and Sequential Decreasing algorithm. This paper also shows the details of the illustrative examples used to explain each parameter measures. At the end of this chapter, the comparative analysis shows the performance of each parameters measures.
منابع مشابه
Reliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملRearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
Rearrangeable networks can realize each and every permutation in one pass through the network. Shuffle-exchange networks provide an efficient interconnection scheme for implementing various types of parallel processes. Whether (2n − 1)-stage shuffle-exchange networks with N = 2n inputs/outputs are rearrangeable has remained an open question for approximately three decades. This question has bee...
متن کاملGeneralized Shuffle - Exchange Networks : Combinatorial and Fault Tolerant Properties
Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and deno...
متن کاملHypercube Networks - III
1. Review of the previous lecture This section highlights the problem of routing a hard problem on the butterfly network. 2. Valiant’s Algorithm This section describes the idea behind Valiant’s algorithm for solving a hard problem on the butterfly network. 3. Ranade’s Algorithm This section briefly introduces Ranade’s algorithm. 4. Shuffle-exchange graph This section explains the properties of ...
متن کاملA New Algorithm For Routing And Scheduling In Optical Omega Network
Multistage interconnection networks (MIN) are popular in switching and communication applications. However, OMINs introduce crosstalk which results from coupling two signals within one Switching Element (SE). Under the constraint of avoiding crosstalk, what we will discuss in is how to realize a permutation that requires the minimum number of passes. In this paper, we are interested in a networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JNW
دوره 9 شماره
صفحات -
تاریخ انتشار 2014